Tetrahedron classes based on edge lengths
نویسندگان
چکیده
منابع مشابه
An Inequality on the Edge Lengths of Triangular Meshes
We give a short proof of the following geometric inequality: for any two triangular meshes A and B of the same polygon C, if the number of vertices in A is at most the number of vertices in B, then the maximum length of an edge in A is at least the minimum distance between two vertices in B. Here the vertices in each triangular mesh include the vertices of the polygon and possibly additional St...
متن کاملLocalization on quantum graphs with random edge lengths
The spectral properties of the Laplacian on a class of quantum graphs with random metric structure are studied. Namely, we consider quantum graphs spanned by the simple Z-lattice with δ-type boundary conditions at the vertices, and we assume that the edge lengths are randomly independently identically distributed. Under the assumption that the coupling constant at the vertices does not vanish, ...
متن کاملDrawing outerplanar graphs using three edge lengths
It is shown that for any outerplanar graph G there is a one to one mapping of the vertices of G to the plane, so that the number of distinct distances between pairs of connected vertices is at most three. This settles a problem of Carmi, Dujmović, Morin and Wood. The proof combines (elementary) geometric, combinatorial, algebraic and probabilistic arguments.
متن کاملGraph topologies induced by edge lengths
Let G be a graph each edge e of which is given a length l(e). This naturally induces a distance dl(x, y) between any two vertices x, y, and we let |G|l denote the completion of the corresponding metric space. It turns out that several well studied topologies on infinite graphs are special cases of |G|l. Moreover, it seems that |G|l is the right setting for studying various problems. The aim of ...
متن کاملMulti-level Edge Detectors Based on Convolution Matrices of Base-lengths 2 and 3
Proposed here is a new approach of edge detectors using edge-detecting masks generated from the basic edge detecting masks and convolution matrices of base lengths 2 and 3. The convolution matrices can be generated from a base unity matrix. These matrices behave like a low pass filter, which are effective in reducing noise in the edge detection process. The size of the convolution matrices incr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Elemente der Mathematik
سال: 2013
ISSN: 0013-6018
DOI: 10.4171/em/221